Phrase structure languages, finite machines, and channel capacity
نویسندگان
چکیده
منابع مشابه
Phrase Structure Grammars and Natural Languages
D u r i n g most o f t he l a s t two decades , c o m p u t a t i o n a l l i n g u i s t s and A I r e s e a r c h e r s w o r k i n g o n n a t u r a l language have assumed t h a t phrase s t r u c t u r e grammars, d e s p i t e t h e i r c o m p u t a t i o n a l t r a c t a b i l i t y , were u n s a t i s f a c t o r y d e v i c e s f o r e x p r e s s i n g the s y n t a x o f n a t u r...
متن کاملA Topological Study of Phrase-Structure Languages
It is proposed that structural equivalence of phrase-structure languages be defined by means of introducing, for each such language, a class of topological structures on the language. More specifically, given a phrase-structure language (either as a set of trees or as a set of strings), we introduce a class of topological spaces associated with finite sets of "phrases." A function from one lang...
متن کاملFinite-State Parsing of Phrase-Structure Languages and the Status of Readjustment Rules in Grammar
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملTheory of molecular machines. I. Channel capacity of molecular machines.
Like macroscopic machines, molecular-sized machines are limited by their material components, their design, and their use of power. One of these limits is the maximum number of states that a machine can choose from. The logarithm to the base 2 of the number of states is defined to be the number of bits of information that the machine could "gain" during its operation. The maximum possible infor...
متن کاملFinite-state subset approximation of phrase structure
We describe a method and a software tool to approximate and manipulate phrase structure grammars by a string representation of derivation trees and an encoding of a finite automaton that recognizes such strings. Many linguistically natural extensions to phrase structure grammars can be modeled on top of the approximation, allowing for a generic mechanism to model parsing and generation of a var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1963
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(63)90199-2